Unordered Merge and Its Linearization

نویسنده

  • Charles D. Yang
چکیده

In the Minimalist Program (Chomsky 1995), Merge is a set operation that imposes no intrinsic ordering among its members. However, syntactic structures are linearized into strings of words at PF. This paper proposes that in order for a Merger set to be linearized, its members must be either hierarchically displaced or morphologically fused into a single terminal node. The empirical study focuses on the structure of DP and its linearization in various constructions. It is shown that the Definiteness Effect (DE) can be attributed to the failure to linearize the DP in unaccusatives. The systematic lack of the DE in some languages (Arabic, Hebrew, and Romanian), unexpected in previous analyses, is due to the morphological N-to-D raising (fusion), therefore satisfying the linearization condition. Furthermore, cross-linguistic evidence is given to show that D can be attracted out of DP for feature checking, rendering transitive DP arguments well-formed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Non-Projective Word Order in Statistical Linearization

We propose a technique to generate nonprojective word orders in an efficient statistical linearization system. Our approach predicts liftings of edges in an unordered syntactic tree by means of a classifier, and uses a projective algorithm for tree linearization. We obtain statistically significant improvements on six typologically different languages: English, German, Dutch, Danish, Hungarian,...

متن کامل

State Isomorphism in Model Programs with Abstract Data Structures

Modeling software features with model programs in C# is a way of formalizing software requirements that lends itself to automated analysis such as model-based testing. Unordered structures like sets and maps provide a useful abstract view of system state within a model program and greatly reduce the number of states that must be considered during analysis. Similarly, a technique called lineariz...

متن کامل

Experiments with Generative Models for Dependency Tree Linearization

We present experiments with generative models for linearization of unordered labeled syntactic dependency trees (Belz et al., 2011; Rajkumar and White, 2014). Our linearization models are derived from generative models for dependency structure (Eisner, 1996). We present a series of generative dependency models designed to capture successively more information about ordering constraints among si...

متن کامل

Merge as a Lattice-Join of XML Documents

We explore theoretical foundations of the Merge operation. Merge functions as a kind of “recursive union” over similarly structured XML documents to produce a new XML document, and can be used for creating aggregates over streams of XML fragments. We describe the Merge operation and show that Merge is in fact the join operation of an upper semi-lattice of conformant documents. Our work relies o...

متن کامل

Partial-Tree Linearization: Generalized Word Ordering for Text Synthesis

We present partial-tree linearization, a generalized word ordering (i.e. ordering a set of input words into a grammatical and fluent sentence) task for text-to-text applications. Recent studies of word ordering can be categorized into either abstract word ordering (no input syntax except for POS) or tree linearization (input words are associated with a full unordered syntax tree). Partial-tree ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999